Mjrty|a Fast Majority Vote Algorithm 1
نویسنده
چکیده
A new algorithm is presented for determining which, if any, of an arbitrary number of candidates has received a majority of the votes cast in an election. The number of comparisons required is at most twice the number of votes. Furthermore, the algorithm uses storage in a way that permits an eecient use of magnetic tape. A Fortran version of the algorithm is exhibited. The Fortran code has been proved correct by a mechanical veriication system for Fortran. The system and the proof are discussed.
منابع مشابه
Hand Gestures Classification with Multi-Core DTW
Classifications of several gesture types are very helpful in several applications. This paper tries to address fast classifications of hand gestures using DTW over multi-core simple processors. We presented a methodology to distribute templates over multi-cores and then allow parallel execution of the classification. The results were presented to voting algorithm in which the majority vote was ...
متن کاملCombining Fuzzy partitions Using Fuzzy Majority Vote and KNN
this paper firstly generalizes majority vote to fuzzy majority vote, then proposes a cluster matching algorithm that is able to establish correspondence among fuzzy clusters from different fuzzy partitions over a common data set. Finally a new combination model of fuzzy partitions is build on the basis of the proposed cluster matching algorithm and fuzzy majority vote. Comparative results show ...
متن کاملAnalysis of Boyer and Moore's MJRTY algorithm
Given a set {x1, x2, . . . , xn}, each element of which is colored either red or blue, we must determine an element of the majority color by making equal/not equal color comparisons xu : xv; when n is even, we must report that there is no majority if there are equal numbers of each color. How many such questions are necessary and sufficient? It is easy to obtain an algorithm using at most n−ν(n...
متن کاملLecture 7 : Full feedback and adversarial rewards ( part II )
Previously, we introduced the best-expert problem, and we proved a O(ln K) mistake bound for the majority vote algorithm when a perfect expert exists, i.e., there is an expert that never makes mistakes. Now let us turn to the more realistic case where there is no perfect expert among the committee. We extend the majority vote algorithm with a confidence weight. At each round, we maintain a weig...
متن کاملRandomized Gossip Algorithms for Achieving Consensus on the Majority Vote
This paper studies a decentralized, randomized gossip algorithm for computing a majority vote amongst the binary decisions associated to n nodes organized in a fixed, ad-hoc network. It is indicated how this problem can be reduced to computing the global average using a standard, randomized gossip algorithm. Then, we illustrate how the majority vote problem allows one to formulate individual st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1982